Solution.java

import java.util.Arrays;
import java.util.Scanner;

public class BinarySearchUnsorted {
    static int binarySearch(int[] arr, int target) {
        int left = 0, right = arr.length - 1;

        while (left <= right) {
            int mid = left + (right - left) / 2;

            if (arr[mid] == target) return mid;
            else if (arr[mid] < target) left = mid + 1;
            else right = mid - 1;
        }

        return -1; // Target not found
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the number of elements: ");
        int n = scanner.nextInt();

        int[] arr = new int[n];
        System.out.println("Enter the unsorted elements:");
        for (int i = 0; i < n; i++) {
            arr[i] = scanner.nextInt();
        }

        System.out.print("Enter the target element: ");
        int target = scanner.nextInt();

        Arrays.sort(arr); // Sort the array

        int result = binarySearch(arr, target);

        if (result != -1) {
            System.out.println("Element found at index " + result + " (after sorting).");
        } else {
            System.out.println("Element not found.");
        }

        scanner.close();
    }
}